Time trade-off: one methodology, different methods
نویسندگان
چکیده
منابع مشابه
Probability and Time Trade-Off
P and time are integral dimensions of virtually any decision. To treat them together, we consider the prospect of receiving outcome x with a probability p at time t. We define risk and time distance, and show that if these two distances are traded off linearly, then preferences are characterized by three functions: a value function, a probability discount rate function, and a psychological dist...
متن کاملA Methodology for Hardware Architecture Trade-off at Different Levels of Abstraction
In this paper a method of architecture exploration and selection is presented. Compared with other approaches, no special tools or modeling languages are needed instead the models and tools of the ASIC design flow are used. The architecture trade-off process is performed iteratively, and considers information from different levels of abstraction in parallel. At system level, software and behavi...
متن کاملA Power-Performance Trade-off Methodology for Portable Reconfigurable Platforms
We have developed a power performance tradeoff methodology for portable reconfigurable computing systems. There are two basic techniques which we employ to vary the power and performance of the application: frequency change and core change. For this methodology we implement a given algorithm with varying power performance levels: we call these implementations, Cores. Each core is characterized ...
متن کاملDynamical Sampling: Time-space Trade-off
We consider the problem of spatiotemporal sampling in which an initial state of an evolution process is to be recovered from a set of samples at different time levels. We are particularly interested in lossless trade-off between spatial and temporal samples. We show that for a special class of signals it is possible to recover the initial state using a reduced number of measuring devices activa...
متن کاملA cryptanalytic time-memory trade-off
A&M&-A probabilistic method is presented wtdcb cryptanalyzes any N key cryptosystem in N2i3 operations with N2j3 words of memory (average vale) after a precomputatioo which requires N operations. If tke precomputation cao be performed in a reasooable time period (e.g* several years), the additional computation reqoired to recover e& key compares very favorably wltb the N operations reqdred by a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The European Journal of Health Economics
سال: 2013
ISSN: 1618-7598,1618-7601
DOI: 10.1007/s10198-013-0508-x